Linear time parsers for classes of non context free languages
نویسندگان
چکیده
منابع مشابه
Linear Time Parsers for Classes of Non Context Free Languages
Deterministic parsers have been proposed for two-level control grammars. These parsers are efficient in both time and space and are simple extensions of the standard LL(I) and LR( 1) parsers for deterministic context free languages. An important advantage of the parsers proposed here is that existing parser generator tools can be augmented to generate them from grammar specifications. Since the...
متن کاملLinear Context-Free Languages Are in NC
This paper concerns linear context-free languages (LIN). We prove that LIN ⊆ NC (under UE∗−uniformity reduction). We introduce a new normal form for context-free grammars, called Dyck normal form. Using this new normal form we prove that for each context-free language L there exist an integer K and a homomorphism φ such that L = φ(D′ K), where D′ K ⊆ DK , and DK is the one-sided Dyck language o...
متن کاملPumping lemmas for linear and nonlinear context-free languages
Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pumping lemmas for the whole class and some special classes of the context-free languages. In this paper we prove new, interesting pumping lemmas for special linear and context-free language classes. Some of them can be used to pump regular languages in two place simultan...
متن کاملNon-redundant random generation algorithms for weighted context-free languages
We address the non-redundant random generation of k words of length n from a contextfree language. Additionally, we want to avoid a predefined set of words. We study a rejection-based approach, whose worst-case time complexity is shown to grow exponentially with k for some specifications and in the limit case of a coupon collector. We propose two algorithms respectively based on the recursive m...
متن کاملLogics For Context-Free Languages
Erklärung Hiermit versichere ich, dass ich die vorliegende Masterarbeit selbstständig verfasst und keine anderen Quellen und Hilfsmittel als die angegebenen benutzt habe.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00231-6